منابع مشابه
Moving Least Squares via Orthogonal Polynomials
A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient method which can avoid singularities and breakdowns in the moving least squares method caused by particular configurations of nodes in the system. The method is tested by applying it to the estimation of first and seco...
متن کاملVector Orthogonal Polynomials and Least Squares Approximation
We describe an algorithm for complex discrete least squares approximation, which turns out to be very efficient when function values are prescribed in points on the real axis or on the unit circle. In the case of polynomial approximation, this reduces to algorithms proposed by Rutishauser, Gragg, Harrod, Reichel, Ammar and others. The underlying reason for efficiency is the existence of a recur...
متن کاملLeast-Squares Adaptive Control Using Chebyshev Orthogonal Polynomials
where x(t) ∈ D ⊂ Rp and f (x) ∈ R is an unknown function but assumed to be bounded function in x. When the structure of the uncertainty is unknown, function approximation is usually employed to estimate the unknown function. In recent years, neural networks have gained a lot of attention in function approximation theory in connection with adaptive control. Multi-layer neural networks have the c...
متن کاملLocal regularization assisted orthogonal least squares regression
A locally regularized orthogonal least squares (LROLS) algorithm is proposed for constructing parsimonious or sparse regression models that generalize well. By associating each orthogonal weight in the regression model with an individual regularization parameter, the ability for the orthogonal least squares model selection to produce a very sparse model with good generalization performance is g...
متن کاملOrthogonal-Least-Squares Forward Selection for
The objective of modelling from data is not that the model simply fits the training data well. Rather, the goodness of a model is characterized by its generalization capability, interpretability and ease for knowledge extraction. All these desired properties depend crucially on the ability to construct appropriate parsimonious models by the modelling process, and a basic principle in practical ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1993
ISSN: 0377-0427
DOI: 10.1016/0377-0427(93)90298-p